Credibility-limited Functions for Belief Bases

Credibility Limited Revision

Five types of constructions are introduced for non-prioritized belief revision, i.e., belief revision in which the input sentence is not always accepted. These constructions include generalizations of entrenchment-based and sphere-based revision. Axiomatic characterizations are provided, and close interconnections are shown to hold between the di®erent constructions. x

Credibility-Limited Improvement Operators

In this paper we introduce and study credibility-limited improvement operators. The idea is to accept the new piece of information if this information is judged credible by the agent, so in this case a revision is performed. When the new piece of information is not credible then it is not accepted (no revision is performed), but its plausibility is still improved in the epistemic state of the a...

Improving Recovery for Belief Bases

The Recovery postulate for contraction says that any beliefs lost due to the contraction of some belief p should return if p is immediately re-asserted. Recovery holds for logically closed sets of beliefs, but it does not hold for belief bases (sets of beliefs that are not logically closed). This paper discusses the Recovery aspect of the belief base optimizing operation of reconsideration (whi...

On Structured Belief Bases -

In this paper some ideas for adding structure to belief bases are presented. Structured belief bases can be seen as graphs, where each node is a belief and two nodes are adjacent if and only if they are related. Some notions of relatedness are deened. We then show how this extra structure can be used for implementing local change as deened in HW98].

Structured Belief Bases